Some Notes on Distance-Transitive and Distance-Regular Graphs
نویسنده
چکیده
These are notes from lectures given in the Queen Mary Combinatorics Study 1 Introductory Definitions In these notes, Γ = (V Γ, EΓ) denotes a graph, as we will use G to denote a group. All graphs considered will be simple, finite, connected and undirected. Definition An automorphism of Γ is a bijective function g : V Γ → V Γ such that v ∼ w if and only if g(v) ∼ g(w). The set of all automorphisms is the automorphism group of Γ, denoted by Aut(Γ). If, for all u, v ∈ V Γ, there exists some g ∈ Aut(Γ) such that g(u) = v, the Γ is vertex-transitive. Examples of vertex-transitive graphs include the n-circuits (not very exciting), and (slightly more exciting) the Petersen graph, pictured below. u u u u Figure 1: The 4-circuit (left) and Petersen graph (right)
منابع مشابه
On nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملThe metric dimension of small distance-regular and strongly regular graphs
A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. A graph is distance-regular if, for any two vertices u, v at each distance i, the number of neighbours of v at each possible distance from u (i.e. i−1, i or i...
متن کاملDistance-regular Cayley graphs on dihedral groups
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کامل